"Kneser graph" meaning in English

{
  "etymology_text": "Named after Martin Kneser, who first investigated them in 1956.",
  "forms": [
    {
      "form": "Kneser graphs",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "Kneser graph (plural Kneser graphs)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        {
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "English entries with language name categories using raw markup",
          "parents": [
            "Entries with language name categories using raw markup",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "English terms with non-redundant non-automated sortkeys",
          "parents": [
            "Terms with non-redundant non-automated sortkeys",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with 1 entry",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with entries",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Graph theory",
          "orig": "en:Graph theory",
          "parents": [
            "Mathematics",
            "Visualization",
            "Formal sciences",
            "Computing",
            "Interdisciplinary fields",
            "Sciences",
            "Technology",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "glosses": [
        "A graph K(n, k) (alternatively KG_(n,k)), whose vertices correspond to the k-element subsets of a set of n elements, and where two vertices are adjacent iff the two corresponding sets are disjoint."
      ],
      "id": "en-Kneser_graph-en-noun-mqRI7VfL",
      "links": [
        [
          "graph theory",
          "graph theory"
        ],
        [
          "graph",
          "graph"
        ],
        [
          "vertices",
          "vertex"
        ],
        [
          "element",
          "element"
        ],
        [
          "subset",
          "subset"
        ],
        [
          "set",
          "set"
        ],
        [
          "adjacent",
          "adjacent"
        ],
        [
          "iff",
          "iff"
        ],
        [
          "disjoint",
          "disjoint"
        ]
      ],
      "raw_glosses": [
        "(graph theory) A graph K(n, k) (alternatively KG_(n,k)), whose vertices correspond to the k-element subsets of a set of n elements, and where two vertices are adjacent iff the two corresponding sets are disjoint."
      ],
      "topics": [
        "graph-theory",
        "mathematics",
        "sciences"
      ]
    }
  ],
  "word": "Kneser graph"
}

{
  "etymology_text": "Named after Martin Kneser, who first investigated them in 1956.",
  "forms": [
    {
      "form": "Kneser graphs",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "Kneser graph (plural Kneser graphs)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        "English countable nouns",
        "English entries with incorrect language header",
        "English entries with language name categories using raw markup",
        "English eponyms",
        "English lemmas",
        "English multiword terms",
        "English nouns",
        "English terms with non-redundant non-automated sortkeys",
        "Pages with 1 entry",
        "Pages with entries",
        "en:Graph theory"
      ],
      "glosses": [
        "A graph K(n, k) (alternatively KG_(n,k)), whose vertices correspond to the k-element subsets of a set of n elements, and where two vertices are adjacent iff the two corresponding sets are disjoint."
      ],
      "links": [
        [
          "graph theory",
          "graph theory"
        ],
        [
          "graph",
          "graph"
        ],
        [
          "vertices",
          "vertex"
        ],
        [
          "element",
          "element"
        ],
        [
          "subset",
          "subset"
        ],
        [
          "set",
          "set"
        ],
        [
          "adjacent",
          "adjacent"
        ],
        [
          "iff",
          "iff"
        ],
        [
          "disjoint",
          "disjoint"
        ]
      ],
      "raw_glosses": [
        "(graph theory) A graph K(n, k) (alternatively KG_(n,k)), whose vertices correspond to the k-element subsets of a set of n elements, and where two vertices are adjacent iff the two corresponding sets are disjoint."
      ],
      "topics": [
        "graph-theory",
        "mathematics",
        "sciences"
      ]
    }
  ],
  "word": "Kneser graph"
}